Morphisms Between Grassmannian Complex and Higher Order Tangent Complex
نویسندگان
چکیده
منابع مشابه
Modeling Complex Higher Order Patterns
The goal of this paper is to show that generalizing the notion of frequent patterns can be useful in extending association analysis to more complex higher order patterns. To that end, we describe a general framework for modeling a complex pattern based on evaluating the interestingness of its sub-patterns. A key goal of any framework is to allow people to more easily express, explore, and commu...
متن کاملOrder Preserving Transformations of the Hilbert Grassmannian: Complex Case
Let H be a separable complex Hilbert space. Denote by G∞(H) the Grassmannian consisting of closed linear subspaces with infinite dimension and codimension. This Grassmannian is partially ordered by the inclusion relation. We show that every continuous order preserving bijective transformation of G∞(H) is induced by an invertible bounded semi-linear operator.
متن کاملHigher-order tangent and secant numbers
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Tangent numbers Tangent numbers of order k Secant numbers Secant numbers of order k Higher-order (or, generalized)...
متن کاملLagrangians and higher order tangent spaces
The aim of the paper is to prove that T M , the tangent space of order k ≥ 1 of a manifold M , is diffeomorphic with T 1 k M , the tangent space of k–velocities, and also with ( T 1 k )∗ M , the cotangent space of k–covelocities, via suitable Lagrangians. One prove also that a hyperregular Lagrangian of first order on M can give rise to such diffeomorphisms. M.S.C. 2000: 53C60, 53C80, 70H50.
متن کاملHigher order assortativity in complex networks
Assortativity was first introduced by Newman and has been extensively studied and applied to many real world networked systems since then. Assortativity is a graph metrics and describes the tendency of high degree nodes to be directly connected to high degree nodes and low degree nodes to low degree nodes. It can be interpreted as a first order measure of the connection between nodes, i.e. the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematics and Applications
سال: 2019
ISSN: 0976-5905,0975-8607
DOI: 10.26713/cma.v10i3.1220